Distribution of First Passage Times for Lumped States in Markov Chains
نویسندگان
چکیده
First passage time in Markov chains is defined as the first time that a chain passes a specified state or lumped states. This state or lumped states may indicate first passage time of an interesting, rare and amazing event. In this study, obtaining distribution of the first passage time relating to lumped states which are constructed by gathering the states through lumping method for a irreducible Markov chain whose state space is finite was deliberated. Thanks to lumping method the chain’s Markov property has been preserved. Another benefit of lumping method in the way of practice is reduction of the state space thanks to gathering states together. As the obtained first passage distributions are continuous, it may be used in many fields such as reliability and risk analysis
منابع مشابه
The Distribution of Mixing times in Markov Chains
The distribution of the “mixing time” or the “time to stationarity” in a discrete time irreducible Markov chain, starting in state i, can be defined as the number of trials to reach a state sampled from the stationary distribution of the Markov chain. Expressions for the probability generating function, and hence the probability distribution of the mixing time starting in state i are derived an...
متن کاملSimple Procedures for Finding Mean First Passage Times in Markov Chains
The derivation of mean first passage times in Markov chains involves the solution of a family of linear equations. By exploring the solution of a related set of equations, using suitable generalized inverses of the Markovian kernel I – P, where P is the transition matrix of a finite irreducible Markov chain, we are able to derive elegant new results for finding the mean first passage times. As ...
متن کاملDISTRIBUTION PROPERTIES OF DISCRETE CHARACTERISTICS IN M/G/l AND GI/M/l QUEUES
It has been shown by many authors that distribution properties of some characteristics in queues are inherited from those of the service times. For instances, Keilson (1978) showed that the length of a busy period in an M/G/l queue has a completely monotone density if so does the service time, Shanthikumar(1988) proved that the waiting time distribution in a GI/G/l queue is DFR if so is the ser...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملEvaluation of First and Second Markov Chains Sensitivity and Specificity as Statistical Approach for Prediction of Sequences of Genes in Virus Double Strand DNA Genomes
Growing amount of information on biological sequences has made application of statistical approaches necessary for modeling and estimation of their functions. In this paper, sensitivity and specificity of the first and second Markov chains for prediction of genes was evaluated using the complete double stranded DNA virus. There were two approaches for prediction of each Markov Model parameter,...
متن کامل